The Composite Bound Method for Computing Throughput Bounds in Multiple Class Environments
نویسنده
چکیده
This paper introduces a new method for calculating upper bounds on sys_________te~thrQughpuLratcs~multiple-cla.s!Lclosed-queueing--.netwoILmodeIs_when _ any lower bounds are known. The lower (pessimistic) bounds used here are multiple class balanced job bounds. The new technique for calculating upper (optimistic) bounds is independent of the system load. The space-time computational costs are linear in the product of the number of classes and devices in the model.
منابع مشابه
Bounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel
In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...
متن کاملOutage Probability Bound and Diversity Gain for Ultra-Wideband Multiple-Access Relay Channels with Correlated Noises
In this paper, Ultra-wideband (UWB) multiple access relay channel with correlated noises at the relay and receiver is investigated. We obtain outer and inner bounds for the IEEE 802.15.3a UWB multiple access relay channel, and also, a diversity gain bound. Finally, we evaluate some results numerically and show that noise correlation coefficients play important role in determining relay position.
متن کاملThroughput Improvement of STS-Based MC DS-CDMA System with Variable Spreading Factor
The throughput enhancement of Space-Time Spreading (STS)-based Multicarrier Direct Sequence Code Division Multiple Access (MC DS-CDMA) system is investigated in this paper. Variable Spreading Factor (VSF) is utilized to improve the data throughput of the system. In this contribution, an analytical approach is proposed to compute a new expression for the Bit Error Rate (BER) performance of t...
متن کاملAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کاملOn a conjecture of a bound for the exponent of the Schur multiplier of a finite $p$-group
Let $G$ be a $p$-group of nilpotency class $k$ with finite exponent $exp(G)$ and let $m=lfloorlog_pk floor$. We show that $exp(M^{(c)}(G))$ divides $exp(G)p^{m(k-1)}$, for all $cgeq1$, where $M^{(c)}(G)$ denotes the c-nilpotent multiplier of $G$. This implies that $exp( M(G))$ divides $exp(G)$, for all finite $p$-groups of class at most $p-1$. Moreover, we show that our result is an improvement...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Perform. Eval.
دوره 6 شماره
صفحات -
تاریخ انتشار 1986